Set cover problem

Results: 76



#Item
31UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m.

UC Berkeley—CS 170 Lecturer: David Wagner Problem Set 12 Due on May 13 at 3:30 p.m.

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2015-01-21 19:48:42
32CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic

CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic

Add to Reading List

Source URL: stanford.edu

Language: English - Date: 2015-03-23 01:42:05
33CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
34Return of the Boss Problem: Competing Online Against a Non-Adaptive Adversary Magnús M. Halldórsson1 and Hadas Sha hnai2 1

Return of the Boss Problem: Competing Online Against a Non-Adaptive Adversary Magnús M. Halldórsson1 and Hadas Sha hnai2 1

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2010-03-19 09:17:44
35Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772)

Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772)

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:03:25
36CCCG 2011, Toronto ON, August 10–12, 2011 Enumerating Minimal Transversals of Geometric Hypergraphs Khaled Elbassioni∗ Imran Rauf†

CCCG 2011, Toronto ON, August 10–12, 2011 Enumerating Minimal Transversals of Geometric Hypergraphs Khaled Elbassioni∗ Imran Rauf†

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:15
37On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk

On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2014-03-27 21:09:14
38Tractable Parameterizations for the Minimum Linear Arrangement Problem Michael R. Fellows1 , Danny Hermelin2 , Frances Rosamond1 , and Hadas Shachnai3 1

Tractable Parameterizations for the Minimum Linear Arrangement Problem Michael R. Fellows1 , Danny Hermelin2 , Frances Rosamond1 , and Hadas Shachnai3 1

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2013-06-22 19:48:39
39URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing

URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing

Add to Reading List

Source URL: www.mrfellows.net

Language: English - Date: 2009-08-06 03:10:30
40CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng†

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2014-07-29 13:44:18